Filtering TOBIAS Combinatorial Test Suites

نویسندگان

  • Yves Ledru
  • Lydie du Bousquet
  • Olivier Maury
  • Pierre Bontron
چکیده

TOBIAS is a combinatorial testing tool, aimed at the production of large test suites. In this paper, TOBIAS is applied to conformance tests for model-based specifications (expressed with assertions, pre and post-conditions) and associated implementations. The tool takes advantage of the executable character of VDM or JML assertions which provide an oracle for the testing process. Executing large test suites may require a lot of time. This paper shows how assertions can be exploited at generation time to filter the set of test cases, and at execution time to detect inconclusive test cases. Keywords: combinatorial testing, model-based specifications, VDM, JML Y. Ledru, L. du Bousquet, O. Maury, and P. Bontron. Filtering TOBIAS combinatorial test suites. In Proceedings of ETAPS/FASE’04 Fundamental Approaches to Software Engineering, pp. 281-294, Vol. 2984 of LNCS, Springer-Verlag, Barcelona, 2004 LNCS proceedings are available at : http://www.springer.de/comp/lncs/index.html This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. ©2004 Springer-Verlag. The copyright for this contribution is held by Springer. "!# $% & $& ' )(* (,+ .( /%021 3)451 687:9<;=45>?6A@B1%689#CED2983:FG981 HI; J.KL@L0?@L1 7 MONP987Q>G;8R @L1 7Q7:1&CED2SGHQ7:D2S T=UWV8X YQU Z[X \]YQ^%T_XI`W\ba:\b^:cbd egfihid[Z j ^ k%^ d e?lnm ^od[^ UWp?qsrutwvyx{z |E} ~ }8 € r _rƒ‚ „I… †‡€ˆr fiUW\]‰2Z{vyUWYQZŠ\]‰ ‹8Œ )j ^:YQ^ d{Ž ^ ‹2^ q%r YQU ‰Gao^ W‘i’2“i” •[–i“ —i˜ ™5š%› œi—8 “ •Š— ™2žWŸ? ™?”W¡ ™?“ ¢2£ ¤G¦¥?§ ̈g•Š© ˜ a¬«_­ ® ̄ °2±i® 2%3{ ́E| tμx fs\bd)Una XIkˆV2\]‰GUIZ[XWY[\bU c Z[^ d[ZŠ\]‰?`yZ[XiXWcμe=UW\bk%^o‹¶UIZ ZŠ·G^) ̧YQX r ‹ipGa ZŠ\bX ‰1X o,cbU YQ` ^yZ[^ d[Z)dŠp2\bZ[^ d }-t»‰1⁄4ZŠ·\bd) ̧GU ̧8^:Y e<3{ ́E| twx1⁄2f \bd&UW ̧2 ̧c]\b^ ‹1⁄4Z[X3⁄4aoXW‰2r oμX YQk%UW‰?a ^ Z[^ d[Z[d oμXWY-k%Xi‹2^:c]rμVGUId[^ ‹ydŠ ̧8^ a:\]¿?a UIZŠ\bXW‰?d.Àμ^ q ̧2YQ^ d[d[^ ‹&Á \bZŠ·¬U d[d[^:YQZŠ\bX ‰Gd e ̧2YQ^ UW‰?‹% ̧8X d[ZŠrƒa X ‰G‹i\bZŠ\bXW‰?dQ UW‰?‹sUId[d[Xia:\bU Z[^o‹Ã\bk) ̧cb^ kÄ^:‰2Z[U ZŠ\bX ‰8d }G3 ·?^ Z[XiXWc8Z[U Åi^ d U ‹2Æ UW‰2Z[UI` ^)XWo ZŠ·?^ ^ qi^ aQpGZ[U Vcb^)a¦·?UWYQUIa Z[^:Y{XWogÇEÈ{vÉX Y1⁄2Ê vyT3⁄4UId[d[^:YQZŠ\bXW‰?dEÁ ·2\ba¦· ̧2YQXWÆ \b‹2^ UW‰ÃXWYQU aQcb^,oμX Y ZŠ·?^EZ[^ d[ZŠ\]‰?` ̧YQXia ^od[d }Ë<qi^ a:p?ZŠ\]‰?`.cbUWYQ`I^EZ[^ d[Z dŠp2\bZ[^ d kÄUWh YQ^ Ì p2\]YQ^%U.cbXIZEXWo-ZŠ\bk%^ }?3 ·\bdE ̧?UW ̧8^QY dŠ·?XWÁ d ·GX Á UId[d[^:YQZŠ\bXW‰?d a UW‰yVÍ^.^ q ̧2cbXW\bZ[^o‹ U Z{` ^:‰?^:YQUIZŠ\bXW‰1⁄4ZŠ\bk%^%Z[X&¿cbZ[^:YÄZŠ·?^%d[^ Z XWo-Z[^ d[Z a UId[^ d e=UW‰?‹3⁄4UIZ ^ qi^ a:p?ZŠ\bXW‰1⁄4ZŠ\bk%^ Z[X%‹2^ Z[^ a Z \]‰?a XW‰?a:c]p?dŠ\bÆi^%Z[^ d[Z a UId[^ d } ÎnÏiÐ8Ñ.ÒÍ ̄ÔÓ ­IÕ.aoX k V\]‰?U Z[X Y[\bUWcyZ[^od[ZŠ\]‰G`2e.kÄXi‹^:c]rμV?U d[^ ‹ÖdŠ ̧8^ a:\]¿?a UIZŠ\bXW‰?d e%ÇEÈ{v#e

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model-Based Filtering of Combinatorial Test Suites

Tobias is a combinatorial test generation tool which can efficiently generate a large number of test cases by unfolding a test pattern and computing all combinations of parameters. In this paper, we first propose a model-based testing approach where Tobias test cases are first run on an executable UML/OCL specification. This animation of test cases on a model allows to filter out invalid test s...

متن کامل

Using SRI SAL model checker for combinatorial tests generation in the presence of temporal constraints

In this paper we describe an approach to use formal analysis tools in conjunction with traditional testing to improve the efficiency of the test generation process. We have developed a technique for the construction of combinatorial test suites, featuring expressive constraints over the models under test and cross coverage evaluation between multiple coverage criteria: combinatorial, structural...

متن کامل

How to Do Tie-breaking in Prioritization of Interaction Test Suites?

The prioritization of interaction test suites has received more attention in the field of combinatorial interaction testing, especially when testing resources are limited to allow the part of combinatorial test cases to be executed. Many strategies have been proposed to prioritize interaction test suites according to different evaluation measures. However, most of these strategies may face a ch...

متن کامل

catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming

We develop an approach to test suite generation for Constrained Combinatorial Testing (CCT), one of the most widely studied combinatorial testing techniques, based on Answer Set Programming (ASP). The resulting catnap system accepts a CCT instance in fact format and combines it with a first-order encoding for generating test suites, which can subsequently be solved by any off-the-shelf ASP syst...

متن کامل

Handling constraints in combinatorial interaction testing in the presence of multi objective particle swarm and multithreading

Context: Combinatorial tes applications. In its simple rations) of a system into configurations of software systems. To implement th are many combinatorial in Constrained combinatorial interaction ulti-objective particle swarm optimisation est generation tools earch-based software engineering est case design techniques Objective: This paper presents presence of constraints. Method: The design a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004